L2-harmonic 1-forms on Complete Manifolds

We study the global behavior of complete minimal δ-stable hypersurfaces in R~(n+1) by using L~2-harmonic 1-forms.We show that a complete minimal δ-stable(δ (n-1)~2/n~2)hypersurface in R~(n+1) has only one end.We also obtain two vanishing theorems of complete noncompact quaternionic manifolds satisfying the weighted Poincar′e inequality.These results are improvements of the first author's theorems on hypersurfaces and quaternionic K¨ahler manifolds.     

On relevation transform involved with statistical dependence between two component lifetimes

Krakowski (Rev Fr Autom Inform Rech Opèr. 1973;7:107–120.) introduced the relevation transform for component and active redundancy with independent lifetimes, and except for Johnson and Kotz (Am J Math Manag Sci. 1981;1:155–165; Nav Res Logist. 1983;30:163–169.) most subsequent researches were conducted under this framework. However, it is not uncommon that a component and its active redundancy bear some common stresses due to the environment and thus they have dependent lifetimes. In this note, we equip the involved lifetimes with a survival copula and then clarify the potential difference between the new and classical versions through making stochastic comparison. Moreover, by ordering the lifetime of system with relevation redundancy we also study the way of allocating a relevation redundancy at component level to ultimately improve the system reliability. The present results on series and parallel systems serve as a generalization of the corresponding ones of Belzunce et al. (Appl Stoch Models Bus Ind. 2019;35:492–503.). Several numerical examples are presented to illustrate these findings as well.     

Fast verified computation for solutions of algebraic Riccati equations arising in transport theory

A fast algorithm for enclosing the solution of the nonsymmetric algebraic Riccati equation arising in transport theory is proposed. The equation has a special structure, which is taken into account to reduce the complexity. By exploiting the structure, the enclosing process involves only quadratic complexity under a reasonable assumption. The algorithm moreover verifies the uniqueness and minimal positiveness of the enclosed solution. Numerical results show the efficiency of the algorithm.     

Semiparametric Bayesian optimal replacement policies: application to railroad tracks

We present a Bayesian decision theoretic approach for developing replacement strategies. In so doing, we consider a semiparametric model to describe the failure characteristics of systems by specifying a nonparametric form for cumulative intensity function and by taking into account effect of covariates by a parametric form. Use of a gamma process prior for the cumulative intensity function complicates the Bayesian analysis when the updating is based on failure count data. We develop a Bayesian analysis of the model using Markov chain Monte Carlo methods and determine replacement strategies. Adoption of Markov chain Monte Carlo methods involves a data augmentation algorithm. We show the implementation of our approach using actual data from railroad tracks. Copyright © 2016 John Wiley & Sons, Ltd.     

关于序超半群的左超理想的研究

本文在序超半群中引入了极小左超理想和极大左超理想的概念, 并讨论了它们的一些相关性质. 进一步地, 引入了序超半群的弱素左超理想、拟素左超理想、拟半素左超理想及弱拟素左超理想的概念, 并讨论这四种素超理想之间的关系. 而且通过左超理想和弱~$m$-系刻画了序超半群的弱拟素左超理想. 同时, 借助于$m$-系对序超半群的拟素左超理想给出刻画. 尤其证明了序超半群$S$是强半单的当且仅当$S$的每个左超理想是$S$的包含它的所有拟素左超理想的交.     

Minimum Degrees of Minimal Ramsey Graphs for Almost‐Cliques

For graphs F and H, we say F is Ramsey for H if every 2‐coloring of the edges of F contains a monochromatic copy of H. The graph F is Ramsey H‐minimal if F is Ramsey for H and there is no proper subgraph of F so that is Ramsey for H. Burr et al. defined to be the minimum degree of F over all Ramsey H‐minimal graphs F. Define to be a graph on vertices consisting of a complete graph on t vertices and one additional vertex of degree d. We show that for all values ; it was previously known that , so it is surprising that is much smaller. We also make some further progress on some sparser graphs. Fox and Lin observed that for all graphs H, where is the minimum degree of H; Szabó et al. investigated which graphs have this property and conjectured that all bipartite graphs H without isolated vertices satisfy . Fox et al. further conjectured that all connected triangle‐free graphs with at least two vertices satisfy this property. We show that d‐regular 3‐connected triangle‐free graphs H, with one extra technical constraint, satisfy ; the extra constraint is that H has a vertex v so that if one removes v and its neighborhood from H, the remainder is connected.     

A short proof of the Wedderburn-Artin theorem

We give a short proof of the Wedderburn–Artin theorem from the viewpoint of completely reducible modules.     

Catenoidal Layers for the Allen-Cahn Equation in Bounded Domains

This paper presents a new family of solutions to the singularly perturbed Allen-Cahn equation α~2Δu + u(1- u~2) = 0 in a smooth bounded domain Ω R~3, with Neumann boundary condition and α 0 a small parameter. These solutions have the property that as α→ 0, their level sets collapse onto a bounded portion of a complete embedded minimal surface with finite total curvature intersecting ?Ω orthogonally and that is non-degenerate respect to ?Ω. The authors provide explicit examples of surfaces to which the result applies.     

二维Helmholtz方程的联合紧致差分离散方程组的预处理方法

对于二维的Helmholtz方程,本文用联合紧致差分格式(CCD)离散,该差分格式具有六阶精度,三点差分和隐式的特点.本文基于CCD格式离散得到的线性系统和循环矩阵的快速傅里叶变换,提出了一种循环型预处理算子用于广义极小残量迭代算法(GMRES).给出了循环型预处理子的求解算法,证明了该预处理算子能使迭代算法具有较快的收敛速度.本文还与其他算法的预处理算子作比较,数值结果表明本文提出的循环型预处理算子具有更好的稳定性,并且对于较大的波数k,收敛速度也更快.     

Subharmonic Solutions with Prescribed Minimal Period of a Discrete Forced Pendulum Equation

Using variational methods, we obtain some sufficient conditions on the existence of subharmonic solutions with prescribed minimal period pT for the second-order difference equation